Decomposition of augmented cubes into regular connected pancyclic subgraphs
نویسندگان
چکیده
منابع مشابه
Pancyclic subgraphs of random graphs
An n-vertex graph is called pancyclic if it contains a cycle of length t for all 3 ≤ t ≤ n. In this paper, we study pancyclicity of random graphs in the context of resilience, and prove that if p n−1/2, then the random graph G(n, p) a.a.s. satisfies the following property: Every Hamiltonian subgraph of G(n, p) with more than (12 +o(1)) ( n 2 ) p edges is pancyclic. This result is best possible ...
متن کاملMaximally local connectivity and connected components of augmented cubes
Article history: Received 8 August 2008 Received in revised form 21 January 2012 Accepted 8 March 2014 Available online 19 March 2014
متن کاملSubgraphs decomposable into two trees and k-edge-connected subgraphs
Given a complete graph with edge weights that satisfy the triangle inequality, we bound the minimum cost of a subgraph which is the union of two spanning trees in terms of the minimum cost of a k-edge-connected subgraph, for k ≤ 4.
متن کاملPartitioning a Graph into Highly Connected Subgraphs
Given k ≥ 1, a k-proper partition of a graph G is a partition P of V (G) such that each part P of P induces a k-connected subgraph of G. We prove that if G is a graph of order n such that δ(G) ≥ √ n, then G has a 2-proper partition with at most n/δ(G) parts. The bounds on the number of parts and the minimum degree are both best possible. We then prove that If G is a graph of order n with minimu...
متن کاملEigensharp Graphs: Decomposition into Complete Bipartite Subgraphs
Let r(G) be the minimum number of complete bipartite subgraphs needed to partition the edges of G, and let r'G) be the larger of the number of positive and number of negative eigenvalues of G. It is known that T{G) > r(G); graphs with t(G) = r(G) are called eigensharp. Eigensharp graphs include graphs, trees, cycles Cn with n = 4 or n ^ 4k, prisms Cn\2K2 with n ^ 3fc, "twisted prisms" (also cal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2020
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2020.03.017